Bi-convex Optimization to Learn Classifiers from Multiple Biomedical Annotations
نویسندگان
چکیده
منابع مشابه
Bi-parametric convex quadratic optimization
In this paper we consider the Convex Quadratic Optimization problem with simultaneous perturbation in the right-hand-side of the constraints and the linear term of the objective function with different parameters. The regions with invariant optimal partitions are investigated as well as the behavior of the optimal value function on the regions. We show that identifying these regions can be done...
متن کاملA Convex Optimization Framework for Bi-Clustering
We present a framework for biclustering and clustering where the observations are general labels. Our approach is based on the maximum likelihood estimator and its convex relaxation, and generalizes recent works in graph clustering to the biclustering setting. In addition to standard biclustering setting where one seeks to discover clustering structure simultaneously in two domain sets, we show...
متن کاملA Framework to Learn Bayesian Network from Changing, Multiple-Source Biomedical Data
Structure learning in Bayesian network is a big issue. Many efforts have tried to solve this problem and quite a few algorithms have been proposed. However, when we attempt to apply the existing methods to microarray data, there are three main challenges: 1) there are many variables in the data set, 2) the sample size is small, and 3) microarray data are changing from experiment to experiment a...
متن کاملStochastic Convex Optimization with Multiple Objectives
In this paper, we are interested in the development of efficient algorithms for convex optimization problems in the simultaneous presence of multiple objectives and stochasticity in the first-order information. We cast the stochastic multiple objective optimization problem into a constrained optimization problem by choosing one function as the objective and try to bound other objectives by appr...
متن کاملFast Multiple-Splitting Algorithms for Convex Optimization
Abstract. We present in this paper two different classes of general K-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we prove that the number of iterations needed by the first class of algorithms to obtain an ε-optimal solution is O(1/ε). The algorithms in the second cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics
سال: 2017
ISSN: 1545-5963
DOI: 10.1109/tcbb.2016.2576457